# !/usr/bin/env python
# -*- coding:utf-8 -*-
# @FileName : p4.py
# @Time     : 2024/5/7 23:08
# @Author   : Robot-Zsj
"""
description:

数的分解

https://blog.csdn.net/qfc_128220/article/details/134863965

i:
21
o:
21=10+11
"""
n = int(input())


def getMinOddLen(x):
    if x < 3:
        return -1

    i = 3
    while i * i <= x:
        if n % i == 0:
            return i
        i += 2
    return x


def getResult():
    if n == 1:
        return "N"

    if n % 2 != 0:
        return f"{n}={n // 2}+{n // 2 + 1}"

    x = n // 2
    while x % 2 == 0:
        x //= 2

    minEvenLen = n // x * 2

    minEvenLen_start = x // 2 - (minEvenLen // 2 - 1)

    minOddLen = getMinOddLen(x)

    minOddLen_start = n // minOddLen - (minOddLen - 1) // 2

    if minOddLen_start >= 1 and minEvenLen_start >= 1:
        if minEvenLen < minOddLen:
            length = minEvenLen
            start = minEvenLen_start
        else:
            length = minOddLen
            start = minOddLen_start
    elif minEvenLen_start >= 1:
        length = minEvenLen
        start = minEvenLen_start
    elif minOddLen_start >= 1:
        length = minOddLen
        start = minOddLen_start
    else:
        return "N"

    arr = []
    for i in range(start, start + length):
        arr.append(i)
    return f"{n}={'+'.join(map(str, arr))}"


print(getResult())
